Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
نویسندگان
چکیده
منابع مشابه
A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملPerturbed zero-sum games with applications to dynamic games
This paper deals with perturbed matrix games. The main result is that the sets of solutions of perturbed games converge to subsets of solutions of appropriate lexicographic games. We consider applications of these results to dynamic games. In particular, we consider applications to repeated games with weighted discounted criteria and to finite-horizon stochastic games with perturbed transition ...
متن کاملBest Response Dynamics for Continuous Zero–sum Games
We study best response dynamics in continuous time for continuous concave-convex zero-sum games and prove convergence of its trajectories to the set of saddle points, thus providing a dynamical proof of the minmax theorem. Consequences for the corresponding discrete time process with small or diminishing step-sizes are established, including convergence of the fictitious play procedure.
متن کاملConvergence of “Best-response Dynamics” in Zero-sum Stochastic Games
Given a two-player zero-sum discounted-payoff stochastic game, we introduce three classes of continuous-time best-response dynamics, stopping-time best-response dynamics, closed-loop best-response dynamics, and open-loop best-response dynamics. We show the global convergence of the first two classes to the set of minimax strategy profiles, and the convergence of the last class when the players ...
متن کاملAn Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles
We present efficient algorithms for computing optimal or approximately optimal strategies in a zero-sum game for which Player I has n pure strategies and Player II has an arbitrary number of pure strategies. We assume that for any given mixed strategy of Player I, a best response or “approximate” best response of Player II can be found by an oracle in time polynomial in n. We then show how our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2019
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2019.1853